An Upper Bound of 7n/6 for the Minimum Size 2EC on Cubic 3-Edge Connected Graphs
نویسنده
چکیده
In this paper, we study the minimum size 2-edge connected spanning subgraph problem (henceforth 2EC) and show that every 3-edge connected cubic graphG = (V,E), with n = |V | allows a 2EC solution for G of size at most 7n 6 , which improves upon Boyd, Iwata and Takazawa’s guarantee of 6n 5 .
منابع مشابه
Towards New Bounds for the 2-Edge Connected Spanning Subgraph Problem
Given a complete graph Kn = (V,E) with non-negative edge costs c ∈ R , the problem multi-2ECcost is that of finding a 2-edge connected spanning multi-subgraph of Kn with minimum cost. It is believed that there are no efficient ways to solve the problem exactly, as it is NP-hard. Methods such as approximation algorithms, which rely on lower bounds like the linear programming relaxation multi-2EC...
متن کاملOn Zagreb Energy and edge-Zagreb energy
In this paper, we obtain some upper and lower bounds for the general extended energy of a graph. As an application, we obtain few bounds for the (edge) Zagreb energy of a graph. Also, we deduce a relation between Zagreb energy and edge-Zagreb energy of a graph $G$ with minimum degree $delta ge2$. A lower and upper bound for the spectral radius of the edge-Zagreb matrix is obtained. Finally, we ...
متن کاملAn Improved Upper Bound for TSP in Cubic 3-Connected Graphs
We consider the classical minimum Travelling Salesman Problem on the class of 3-edge-connected cubic graphs. More specifically we consider their (shortest path) metric completions. The well-known conjecture states that the subtour elimination LP relaxation on the min TSP yields a 4/3 approximation factor, yet the best known approximation factor is 3/2. The 3-edge-connected cubic graphs are inte...
متن کاملOn the Integrality Gap of the 2-Edge Connected Subgraph Problem
Given a complete graph on n vertices with nonnegative edge costs, the 2-edge connected subgraph problem (2EC) is that of finding a 2-edge connected multi-subgraph of minimum cost. The linear programming relaxation of this problem (2EC ) provides a lower bound for 2EC, and its study provides a promising direction for finding improved solutions for 2EC. It has been conjectured that the integralit...
متن کاملToward a 6/5 Bound for the Minimum Cost 2-Edge Connected Subgraph Problem
Given a complete graph Kn = (V,E) with non-negative edge costs c ∈ RE , the problem 2EC is that of finding a 2-edge connected spanning multi-subgraph of Kn of minimum cost. The integrality gap α2EC of the linear programming relaxation 2EC for 2EC has been conjectured to be 65 , although currently we only know that 65 ≤ α2EC ≤ 3 2 . In this paper, we explore the idea of using the structure of so...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1706.01609 شماره
صفحات -
تاریخ انتشار 2017